
The architecture and performance of topic%2Ddriven P2P resource discovery system.

A fast algorithm for mining frequent ordered subtrees.

AMIOT Induced Ordered Tree Mining in Tree%2DStructured Databases.

Parallel Vector Computing Technique for Discovering Communities on the Very Large Scale Web Graph.

Extended Association Algorithm Based on ROC Analysis for Visual Information Navigator.

Mining Association Algorithm with Threshold based on ROC Analysis.
The mining association algorithm is one of the most important data mining algorithms to derive association rules at high speed from huge databases. However, the algorithm tends to derive those rules that contain noises such as stopwords then some systems remove the noises using noise filters. We have been improving the algorithm and developing navigation systems for semi-structured data using the algorithm, and we also use a dictionary to remove noises from derived association rules. In order to derive effective rules, it is very important how to determine system parameters such as threshold values of the minimum support and the minimum confidence. Then we have adapted the ROC analysis to the algorithm on our navigation systems and evaluated the performance of derived rules. In this paper, we import the parameters from the ROC analysis into the algorithm to propose extended mining association algorithms. Moreover, we evaluate the performance of our proposed algorithms using a experimental database and show how our proposed algorithms can derive effective association rules. We also show that our proposed algorithms can remove stopwords automatically from raw data.
Information Gathering and Searching Approaches on the Web.

Mondou Information Navigator with Visual Interface.

An Application of Text Mining Bibliographic Navigator Powered by Extended Association Rules.
In this paper, we discuss the implementation and performance of our developed bibliographic navigator with the text mining. We categorize the different attributes and extend the mining association algorithms and in order to provide more helpful rules. By our proposed algorithm, more interesting rules are derived from relationships between several categorized attributes in bibliographic databases such as INSPEC. We also evaluate the performance of our proposed algorithms on our developing bibliographic navigator and discuss the improvements of our navigator.
Overview of Mondou Web Search Engine Using Text Mining and Information Visualizing.

Performance Evaluation and Visualization of Association Rules using Receiver Operating Characteristic Graph.

Mining Association Algorithm Based on ROC Convex Hull Method in Bibliographic Navigation System.

ROC Performance Evaluation of Web%2DBased Bibliographic Navigator using Extended Association Rules.

Mondou Interface with Text Data Mining for Web Search Engine.

Experiments of Collecting WWW Information Using Distributed WWW Robots.
Abstract This paper presents the experiments of col-lecting the documents on the WWW using distributed WWW robots. We propose distributed WWW robots to collect the documents quickly. Our final goal is to col-lect all of the documents on the WWW in Japan within one day. Currently, eight distributed WWW Robots are running in Japan. The experimental results show that we are able to gain 5.8 to 9.7 times speedup when four distributed WWW robots are placed at different places in comparison with when only one WWW robot is used. 1
Generalization%2DBased Data Mining in Object%2DOriented Databases Using an Object Cube Model.
Data mining is the discovery of knowledge and useful information from the large amounts of data stored in  databases. With the increasing popularity of object-oriented database systems in advanced database applications,  it is important to study the data mining methods for object-oriented databases because mining knowledge from  such databases may improve understanding, organization, and utilization of the data stored there.
Attribute Oriented Mining Algorithm with Entropy%2Dbased Cost Functions.

How Does Knowledge Discovery Cooperate with Active Database Techniques in Controlling Dynamic Environment%3F
. A dynamic environment, such as a production process, a  communication network, highway traffic, etc., may contain a huge amount  of information, changing with time, which is a valuable resource for understanding  the general behavior of the environment, discovering the  regularities and anomalies currently happening in the environment, controlling  an evolution process, and intelligent modeling or managing the  environment. Unfortunately, the data generated in a dynamic environment  are often expressed in low level primitives and in huge volumes.  Because of the dynamic, continuous and rapid changes of the information  flow, it is difficult to catch the regularities and anomalies in a dynamic  environment and react promptly for real-time applications. In this study,  a knowledge discovery technique is integrated with data sampling and  active database techniques to discover interesting behaviors of a dynamic  environment and react intelligently to the environment changes. The discove...
Tree Algorithms for Random Access Channels in Local Area Networks.

